Approximation Analysis for Routing with Clue in Mesh TCP/IP Network

نویسنده

  • Piboonlit Viriyaphol
چکیده

Transmission Control Protocol/ Internet Protocol (TCP/IP) network is widely used as the source of information and medium of communication. An Internet Protocol (IP) also becomes the most important core protocol used in the world’s largest network. The larger IP network size it becomes the longer IP addressing delay it endures, so many techniques are invented to increase the performance of the IP lookup process. One of the most interesting ideas is Routing with a Clue (RC) which introduces the distribution of IP lookup process to all nodes along the route/path. This paper compares the performance of the distributed IP lookup with conventional IP lookup process by applying to expandable meshed network. We simulated up to three meshed nodes network. Then, the performance matrices such as throughput (THRU), mean queue length (MQL), mean waiting time (MWT), and utilization factor (ρ), are collected in order to explain the effect of expanding network (scalability) versus the performance of both networks. Results indicate that RC network outperforms vis-a-vis the conventional IP network in terms of expanding the network size. Moreover, the performance of the RC network is not dropping much compared to those of the IP network. As the data rates are increased, simulations show that throughputs from both RC and IP network also increased, however the throughputs as of RC network outperform in all data rates. The input traffic fluctuates into the first mesh causing higher burden for nodes in the first mesh than ones in the next adjacent mesh, so performance parameters for nodes in the first mesh is found to be lower than those in the next meshes. Results from nodes in the higher mesh indicate that the nodes will handle little low traffic, in other words they experience fewer packets waiting in the queue. Especially in RC network, MWT for nodes in the last mesh is next to zero. The reason is that over RC network, IP lookup process is distributed to all nodes along the path, so packet holding (check for address) is reduced reflecting all performance parameters, such as throughputs, MQL, MWT, and utilization factor to be better than the conventional IP network. Once Manuscript received on September 21, 2005 ; revised on May

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Analysis of a New Neural Network for Routing in Mesh Interconnection Networks

Routing is one of the basic parts of a message passing multiprocessor system. The routing procedure has a great impact on the efficiency of a system. Neural algorithms that are currently in use for computer networks require a large number of neurons. If a specific topology of a multiprocessor network is considered, the number of neurons can be reduced. In this paper a new recurrent neural ne...

متن کامل

Routing with the Clue (RC) over IP Networks

Internet Protocol (IP) becomes the most important protocol as the core protocol used in the world’s largest network. The larger IP network size it becomes the higher IP addressing delay the network has to consume, so many techniques are invented to increase the performance of the IP lookup process. One of the most interesting ideas is Routing with a Clue (RC) which introduces the distributed IP...

متن کامل

Performance Analysis of a New Neural Network for Routing in Mesh Interconnection Networks

Routing is one of the basic parts of a message passing multiprocessor system. The routing procedure has a great impact on the efficiency of a system. Neural algorithms that are currently in use for computer networks require a large number of neurons. If a specific topology of a multiprocessor network is considered, the number of neurons can be reduced. In this paper a new recurrent neural ne...

متن کامل

TCP adaptation with network coding and opportunistic data forwarding in multi-hop wireless networks

Opportunistic data forwarding significantly increases the throughput in multi-hop wireless mesh networks by utilizing the broadcast nature of wireless transmissions and the fluctuation of link qualities. Network coding strengthens the robustness of data transmissions over unreliable wireless links. However, opportunistic data forwarding and network coding are rarely incorporated with TCP becaus...

متن کامل

Improving Channel Assignment in Multi-radio Wireless Mesh Networks with Learning Automata

Wireless mesh networks (WMNs) consist of static nodes that usually have one or more radios or media. Optimal channel assignment (CA) for nodes is a challenging problem inWMNs. CA aims tominimize interference in the overall network and thus increase the total capacity of the network. This paper proposes a new method for solving the CA problem that comparatively performs more efficient than exist...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006